On the Convergence of Unconstrained Adaptive Markov Chain Monte Carlo Algorithms
نویسندگان
چکیده
منابع مشابه
Markov Chain Monte Carlo Algorithms: Theory and Practice
We describe the importance and widespread use of Markov chain Monte Carlo (MCMC) algorithms, with an emphasis on the roles in which theoretical analysis can help with their practical implementation. In particular, we discuss how to achieve rigorous quantitative bounds on convergence to stationarity using the coupling method together with drift and minorisation conditions. We also discuss recent...
متن کاملAutomatically Tuned General-Purpose MCMC via New Adaptive Diagnostics
Adaptive Markov Chain Monte Carlo (MCMC) algorithms attempt to ‘learn’ from the results of past iterations so the Markov chain can converge quicker. Unfortunately, adaptive MCMC algorithms are no longer Markovian, so their convergence is difficult to guarantee. In this paper, we develop new diagnostics to determine whether the adaption is still improving the convergence. We present an algorithm...
متن کاملOn the Containment Condition for Adaptive Markov Chain Monte Carlo Algorithms
This paper considers ergodicity properties of certain adaptive Markov chain Monte Carlo (MCMC) algorithms for multidimensional target distributions, in particular Adaptive Metropolis and Adaptive Metropoliswithin-Gibbs. It was previously shown by Roberts and Rosenthal (2007) that Diminishing Adaptation and Containment imply ergodicity of adaptive MCMC. We derive various sufficient conditions to...
متن کاملConvergence of Adaptive Markov Chain Monte Carlo Algorithms
In the thesis, we study ergodicity of adaptive Markov Chain Monte Carlo methods (MCMC) based on two conditions (Diminishing Adaptation and Containment which together imply ergodicity), explain the advantages of adaptive MCMC, and apply the theoretical result for some applications. First we show several facts: 1. Diminishing Adaptation alone may not guarantee ergodicity; 2. Containment is not ne...
متن کاملOn the convergence rates of some adaptive Markov chain Monte Carlo algorithms
This paper studies the mixing time of certain adaptive Markov Chain Monte Carlo algorithms. Under some regularity conditions, we show that the convergence rate of Importance Resampling MCMC (IRMCMC) algorithm, measured in terms of the total variation distance is O(n−1), and by means of an example, we establish that in general, this algorithm does not converge at a faster rate. We also study the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010